Forward Analysis of Timed Automata
نویسندگان
چکیده
Timed automata constitute a well adapted model for real-time aspects. However, a classical forward analysis algorithm used to verify safety properties has been showed to be incorrect in the general framework of timed automata. Nevertheless, it is correct when we restrict the class to timed automata with only non-diagonal guards. The aim of this work is to understand the role of diagonal guards and propose a method that provides correct algorithms in the general case.
منابع مشابه
Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملForward Analysis of Updatable Timed Automata
Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it suffers from a state explosion and is thus not used in practice. Instead, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When ...
متن کاملPatricia Bouyer Timed Automata May Cause Some Troubles
Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it does not support a natural implementation and, in practice, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on fo...
متن کاملSymbolic Optimal Reachability in Weighted Timed Automata
Weighted timed automata have been defined in the early 2000’s for modelling resource-consumption or -allocation problems in real-time systems. Optimal reachability is decidable in weighted timed automata, and a symbolic forward algorithm has been developed to solve that problem. This algorithm uses so-called priced zones, an extension of standard zones with cost functions. In order to ensure te...
متن کاملAn Over-Approximation Forward Analysis for Nested Timed Automata
Nested timed automata(NeTAs), proposed by Li et al., are a pushdown system whose stack symbols are timed automata (TAs). With this formal models, we can model and analyze complex real-time frameworks with recursive context switches. The reachability problem of NeTAs is proved to be decidable, via encoding NeTAs to dense timed pushdown automata (DTPDAs). This paper gives a forward algorithm for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009